package com.yun.algorithmproblem.leetcode;

import java.util.PriorityQueue;

public class Leetcode1760 {

    public int minimumSize(int[] nums, int maxOperations) {
        PriorityQueue<Integer> pq=new PriorityQueue<>();
        for (int num : nums) {
            pq.offer(num);
        }
        for (int i = 0; i < maxOperations; i++) {
            Integer poll = pq.poll();

        }
        return 0;
    }
}
